| 翻訳と辞書 |
| matrix decomposition ： ウィキペディア英語版 |
matrix decomposition
In the mathematical discipline of linear algebra, a matrix decomposition or matrix factorization is a factorization of a matrix into a product of matrices. There are many different matrix decompositions; each finds use among a particular class of problems.
== Example ==
In numerical analysis, different decompositions are used to implement efficient matrix algorithms.
For instance, when solving a system of linear equations , the matrix ''A'' can be decomposed via the LU decomposition. The LU decomposition factorizes a matrix into a lower triangular matrix ''L'' and an upper triangular matrix ''U''. The systems and require fewer additions and multiplications to solve, compared with the original system , though one might require significantly more digits in inexact arithmetic such as floating point.
Similarly, the QR decomposition expresses ''A'' as ''QR'' with ''Q'' an orthogonal matrix and ''R'' an upper triangular matrix. The system ''Q''(''Rx'') = ''b'' is solved by ''Rx'' = ''Q''T''b'' = ''c'', and the system ''Rx'' = ''c'' is solved by 'back substitution'. The number of additions and multiplications required is about twice that of using the LU solver, but no more digits are required in inexact arithmetic because the QR decomposition is numerically stable.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「matrix decomposition」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|